Rationalizable bidding in first-price auctions
نویسندگان
چکیده
We analyze the consequences of strategically sophisticated bidding without assuming equilibrium behavior. In particular, we characterize interim rationalizable bids in symmetric first-price auctions with interdependent values and affiliated signals. We show that (1) every non-zero bid below the equilibrium is rationalizable, (2) some bids above the equilibrium are rationalizable, (3) the upper bound on rationalizable bids of a given player is a nondecreasing function of her signal. In the special case of independent signals and quasi-linear valuation functions, (i) the least upper bound on rationalizable bids is concave; hence (ii) rationalizability implies substantial proportional shading for high valuations, but is consistent with negligible proportinal shading for low valuations. We argue that our theoretical analysis may shed some light on experimental findings about deviations from the risk-neutral Nash equilibrium.
منابع مشابه
Rationalizable outcomes of large independent private-value ...rst-price discrete auctions.1
We consider discrete versions of independent, private-value, ...rst-price auctions. We show for any ...xed ...nite set of possible bids, if the number of participants is large enough, then the set of rationalizable bids involves all players bidding the highest bid that is lower than their private value.
متن کاملRationalizable Strategies and Perfect Equilibria in Common Value Auctions with Variable Supply
Auctions with variable supply are multi-unit auctions, in which the seller determines the supply quantity as a function of the bidding. These auctions are used on various markets ranging from Treasury bills and IPOs to rare wine and art. In this work we compare in a common value model the mixed strategy subgame perfect equilibria and the rationalizable strategies of the uniform price and the di...
متن کاملRationalizable outcomes of large independent private-value first-price discrete auctions.1
We consider discrete versions of first-price auctions. We present a condition on beliefs about players’ values such that, with any fixed finite set of possible bids and sufficiently many players, only bidding the bid closest from below to one’s true value survives iterative deletion of bids that are dominated, where the dominance is evaluated using beliefs that satisfy the condition. The condit...
متن کاملThe Spite Motive and Equilibrium Behavior in Auctions
We study auctions where bidders have independent private values but attach a disutility to the surplus of rivals, and derive symmetric equilibria for first-price, second-price, English, and Dutch auctions. We find that equilibrium bidding is more aggressive than standard predictions. Indeed, in second-price auctions it is optimal to bid above one’s valuation; that is, bidding “frenzies” can ari...
متن کاملMonotonicity and Rationalizability in a Large First Price Auction
This paper proves that the monotonicity of bidding strategies together with the rationality of bidders implies that the winning bid in a first price auction converges to the competitive equilibrium price as the number of bidders increases (Wilson (1977)). Instead of analyzing the symmetric Nash equilibrium, we examine rationalizable strategies (Bernheim (1984) and Pearce (1984)) among the set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Games and Economic Behavior
دوره 45 شماره
صفحات -
تاریخ انتشار 2003